Request-aware Cooperative I/O Scheduling for Scale-out Database Applications

نویسندگان

  • Hyungil Jo
  • Sung-Hun Kim
  • Sangwook Kim
  • Jinkyu Jeong
  • Joonwon Lee
چکیده

Interactive data center applications suffer from the tail latency problem. Since most modern data center applications take the sharded architecture to serve scale-out services, a request comprises multiple sub-requests handled in individual back-end nodes. Depending on the state of each back-end node, a node may issue multiple I/Os for a single sub-request. Since traditional I/O scheduling operates in an application-agnostic manner, it sometimes causes a long latency gap between the responses of sub-requests, thereby delaying the response to endusers. In this paper, we propose a request-aware cooperative I/O scheduling scheme to reduce the tail latency of a database application. Our proposed scheme captures request arrival order at the front-end of an application and exploits it to make a decision for I/O scheduling in individual back-end nodes. We implemented a prototype based on MongoDB and the Linux kernel and evaluated it with a read-intensive scan workload. Experimental results show that our proposed scheme effectively reduces the latency gap between sub-requests, thereby reducing the tail latency.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Differentiated I/O services in Virtualized environments

There is a huge semantic gap between file system and storage in servicing an I/O request. In a virtual environment the gap increases even more, as the hypervisor’s I/O scheduler is not aware of the semantics of the I/O request that the application issues. To address this limitation and to retain the semantics of the I/O requests in a virtualized environment, we tag each I/O request from the gue...

متن کامل

Cooperative Batch Scheduling for HPC Systems

The batch scheduler is an important system software serving as the interface between users and HPC systems. Users submit their jobs via batch scheduling portal and the batch scheduler makes scheduling decision for each job based on its request for computing sources, i.e. core-hours. However, jobs submitted to HPC systems are usually parallel applications and their lifecycle consists of multiple...

متن کامل

Security-Aware Periodic-Write Scheduling for Mission-Critical Embedded Storage System

⎯High quality of security and guaranteed real-time requirements are two key goals of missioncritical embedded storage systems. But most existing real-time disk scheduling algorithms do not consider improving security performance of disk requests. A security-aware periodic-write (SAPW) scheduling algorithm is proposed to judiciously select appropriate security level for each disk request to maxi...

متن کامل

Comparison of I/O Scheduling Algorithms for High Parallelism MEMS-Based Storage Devices

MEMS-based storage is one of the leading candidates as tomorrow’s storage medium due to its salient characteristics such as high-parallelism, high density, and low-power consumption. Because physical structures of MEMS-based storage is different from those of hard disks, new software management techniques for MEMS-based storage are needed. Specifically, MEMS-based storage has thousands of paral...

متن کامل

Toward Scheduling I/O Request of Mapreduce Tasks Based on Markov Model

In Cloud storage of multiple CPU cores, many Mapreduce applications may run in parallel on each compute node and collocate with local Disks storage. These Disks storage are shared by multiple applications that use full CPU power of the node. Each application tends to issue contiguous I/O requests in parallel to the same Disk; however if large number of Mapreduce tasks enters the I/O phase at th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017